A Deduction Method Complete for Refutation and Finite Satisfiability

Database and Artiicial Intelligence applications are brieey discussed and it is argued that they need deduction methods that are not only refutation complete but also complete for nite satissability. A novel deduction method is introduced for such applications. Instead of relying on Skolemization, as most refutation methods do, the proposed method processes existential quantiiers in a special manner which makes it complete not only for refutation, but also for nite satissability. A main contribution of this paper is the proof of these results.